A Coordination Algorithm for Multi-Agent Planning

One of the major interests of Multi-Agent Systems (MAS), which are able to handle distributed planning, is coordination. This coordination requires both an adequate plan representation and eecient interacting methods between agents. Interactions are based on information exchange (e.g. data, partial or global plan) and allow agents to update their own plans by including the exchanged information. Coordination generally produces two eeects: it cancels negative interactions (e.g. resource sharing) and it takes advantage of helpful ones (e.g. handling redundant actions). A coordination model should satisfy the following requirements: domain independence, broad covering of interacting situations , operational coordination semantics and natural expression for the designer. This paper presents an adequate framework for the representation and handling of plans in MAS. It then shows how an approach based on a plan representation by means of a partial order model enables the deenition of a coordination algorithm for the possible enrichment of plans.